Upper and lower bounds for an eigenvalue associated with a positive eigenvector
نویسندگان
چکیده
منابع مشابه
Upper and lower bounds for numerical radii of block shifts
For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کاملUpper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کاملLower and Upper Bounds for Positive Linear Functionals
This paper deals with the problem of finding lower and upperbounds in a set of convex functions to a given positive linear functional; that is, bounds which estimate always below (or above) a functional over a family of convex functions. A new set of upper and lower bounds are provided and their extremal properties are established. Moreover, we show how such bounds can be combined to produce be...
متن کاملupper and lower bounds for numerical radii of block shifts
for an n-by-n complex matrix a in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of a. in this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کاملLower Bounds and Upper Bounds for MaxSAT
This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be substantially improved when its search is init...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Physics
سال: 2006
ISSN: 0022-2488,1089-7658
DOI: 10.1063/1.2168124